Infinite square-free self-shuffling words
نویسندگان
چکیده
An infinite word w is called self-shuffling, if w = ∏ ∞ i=0 UiVi = ∏ ∞ i=0 Ui = ∏ ∞ i=0 Vi for some finite words Ui, Vi. Harju [4] recently asked whether square-free self-shuffling words exist. We answer this question affirmatively.
منابع مشابه
On Shuffling of Infinite Square-Free Words
In this paper we answer two recent questions from Charlier et al. (2014) and Harju (2013) about self-shuffling words. An infinite word w is called self-shuffling, if w = ∏∞ i=0 UiVi = ∏∞ i=0 Ui = ∏∞ i=0 Vi for some finite words Ui, Vi. Harju recently asked whether square-free self-shuffling words exist. We answer this question affirmatively. Besides that, we build an infinite word such that no ...
متن کاملInfinite self-shuffling words
In this paper we introduce and study a new property of infinite words: An infinite word x ∈ A, with values in a finite set A, is said to be k-self-shuffling (k ≥ 2) if x admits factorizations: x = ∏∞ i=0 U (1) i · · ·U (k) i = ∏∞ i=0 U (1) i = · · · = ∏∞ i=0 U (k) i . In other words, there exists a shuffle of k-copies of x which produces x. We are particularly interested in the case k = 2, in w...
متن کاملThe minimal density of a letter in an infinite ternary square - free word is 0 . 2746
We study the minimal density of letters in infinite square-free words. First, we give some definitions of minimal density in infinite words and prove their equivalence. Further, we propose a method that allows to strongly reduce an exhaustive search for obtaining lower bounds for minimal density. Next, we develop a technique for constructing square-free morphisms with extremely small density fo...
متن کاملAbelian Square-Free Partial Words
Erdös raised the question whether there exist infinite abelian square-free words over a given alphabet (words in which no two adjacent subwords are permutations of each other). Infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words (sequences that may contain some h...
متن کاملSquare-free shuffles of words
Let u v denote the set of all shuffles of the words u and v . It is shown that for each integer n ≥ 3 there exists a square-free ternary word u of length n such that u u contains a square-free word. This property is then shown to also hold for infinite words, i.e., there exists an infinite square-free word u on three letters such that u can be shuffled with itself to produce an infinite square-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.6536 شماره
صفحات -
تاریخ انتشار 2014